TSTP Solution File: SET185^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET185^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:04:39 EDT 2024
% Result : Theorem 0.11s 0.34s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 19 ( 3 unt; 5 typ; 0 def)
% Number of atoms : 107 ( 42 equ; 0 cnn)
% Maximal formula atoms : 10 ( 7 avg)
% Number of connectives : 118 ( 17 ~; 18 |; 12 &; 57 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 ^ 22 !; 11 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > $o ).
thf(func_def_5,type,
sK1: a > $o ).
thf(func_def_6,type,
sK2: a ).
thf(f15,plain,
$false,
inference(subsumption_resolution,[],[f12,f14]) ).
thf(f14,plain,
( $true
= ( sK0 @ sK2 ) ),
inference(subsumption_resolution,[],[f13,f11]) ).
thf(f11,plain,
! [X3: a] :
( ( $true
= ( sK0 @ X3 ) )
| ( $true
!= ( sK1 @ X3 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
( ( ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) ) )
& ( $true
!= ( sK0 @ sK2 ) )
& ! [X3: a] :
( ( $true
!= ( sK1 @ X3 ) )
| ( $true
= ( sK0 @ X3 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f9,f8]) ).
thf(f8,plain,
( ? [X0: a > $o,X1: a > $o] :
( ? [X2: a] :
( ( ( ( X1 @ X2 )
= $true )
| ( ( X0 @ X2 )
= $true ) )
& ( ( X0 @ X2 )
!= $true ) )
& ! [X3: a] :
( ( $true
!= ( X1 @ X3 ) )
| ( $true
= ( X0 @ X3 ) ) ) )
=> ( ? [X2: a] :
( ( ( $true
= ( sK1 @ X2 ) )
| ( $true
= ( sK0 @ X2 ) ) )
& ( $true
!= ( sK0 @ X2 ) ) )
& ! [X3: a] :
( ( $true
!= ( sK1 @ X3 ) )
| ( $true
= ( sK0 @ X3 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ? [X2: a] :
( ( ( $true
= ( sK1 @ X2 ) )
| ( $true
= ( sK0 @ X2 ) ) )
& ( $true
!= ( sK0 @ X2 ) ) )
=> ( ( ( $true
= ( sK1 @ sK2 ) )
| ( $true
= ( sK0 @ sK2 ) ) )
& ( $true
!= ( sK0 @ sK2 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: a > $o,X1: a > $o] :
( ? [X2: a] :
( ( ( ( X1 @ X2 )
= $true )
| ( ( X0 @ X2 )
= $true ) )
& ( ( X0 @ X2 )
!= $true ) )
& ! [X3: a] :
( ( $true
!= ( X1 @ X3 ) )
| ( $true
= ( X0 @ X3 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
? [X1: a > $o,X0: a > $o] :
( ? [X3: a] :
( ( ( $true
= ( X0 @ X3 ) )
| ( $true
= ( X1 @ X3 ) ) )
& ( $true
!= ( X1 @ X3 ) ) )
& ! [X2: a] :
( ( ( X0 @ X2 )
!= $true )
| ( ( X1 @ X2 )
= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X1: a > $o,X0: a > $o] :
( ! [X2: a] :
( ( ( X0 @ X2 )
= $true )
=> ( ( X1 @ X2 )
= $true ) )
=> ! [X3: a] :
( ( ( $true
= ( X0 @ X3 ) )
| ( $true
= ( X1 @ X3 ) ) )
=> ( $true
= ( X1 @ X3 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ! [X3: a] :
( ( ( X1 @ X3 )
| ( X0 @ X3 ) )
=> ( X1 @ X3 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ! [X2: a] :
( ( ( X1 @ X2 )
| ( X0 @ X2 ) )
=> ( X1 @ X2 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: a > $o,X1: a > $o] :
( ! [X2: a] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) )
=> ! [X2: a] :
( ( ( X1 @ X2 )
| ( X0 @ X2 ) )
=> ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.8CQ5V6dCRl/Vampire---4.8_25048',cBOOL_PROP_35_pme) ).
thf(f13,plain,
( ( $true
= ( sK0 @ sK2 ) )
| ( $true
= ( sK1 @ sK2 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f12,plain,
( $true
!= ( sK0 @ sK2 ) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SET185^5 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.32 % Computer : n008.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 16:36:23 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a TH0_THM_NEQ_NAR problem
% 0.11/0.33 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.8CQ5V6dCRl/Vampire---4.8_25048
% 0.11/0.34 % (25156)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.11/0.34 % (25159)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.11/0.34 % (25160)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.11/0.34 % (25161)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.11/0.34 % (25158)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (3000ds/27Mi)
% 0.11/0.34 % (25157)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.11/0.34 % (25162)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.11/0.34 % (25159)First to succeed.
% 0.11/0.34 % (25163)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (3000ds/3Mi)
% 0.11/0.34 % (25160)Instruction limit reached!
% 0.11/0.34 % (25160)------------------------------
% 0.11/0.34 % (25160)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (25160)Termination reason: Unknown
% 0.11/0.34 % (25160)Termination phase: Saturation
% 0.11/0.34
% 0.11/0.34 % (25160)Memory used [KB]: 5500
% 0.11/0.34 % (25160)Time elapsed: 0.003 s
% 0.11/0.34 % (25160)Instructions burned: 2 (million)
% 0.11/0.34 % (25160)------------------------------
% 0.11/0.34 % (25160)------------------------------
% 0.11/0.34 % (25161)Also succeeded, but the first one will report.
% 0.11/0.34 % (25156)Also succeeded, but the first one will report.
% 0.11/0.34 % (25159)Refutation found. Thanks to Tanya!
% 0.11/0.34 % SZS status Theorem for Vampire---4
% 0.11/0.34 % SZS output start Proof for Vampire---4
% See solution above
% 0.11/0.34 % (25159)------------------------------
% 0.11/0.34 % (25159)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (25159)Termination reason: Refutation
% 0.11/0.34
% 0.11/0.34 % (25159)Memory used [KB]: 5500
% 0.11/0.34 % (25159)Time elapsed: 0.003 s
% 0.11/0.34 % (25159)Instructions burned: 1 (million)
% 0.11/0.34 % (25159)------------------------------
% 0.11/0.34 % (25159)------------------------------
% 0.11/0.34 % (25155)Success in time 0.012 s
% 0.11/0.34 % Vampire---4.8 exiting
%------------------------------------------------------------------------------